Approximations and Representations for Fourier Transforms
نویسندگان
چکیده
منابع مشابه
Approximate fast graph Fourier transforms via multi-layer sparse approximations
The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n logn) instead of O(n) arithmetic operations. Graph Signal Processing (GSP) is a recent research domain that generalizes classical signal processing tools, such as the Fourier transform, to situations where the signal domain is given by any arbitrary gr...
متن کاملFuzzy and Fourier Transforms
The fuzzy transform (F -transform for short) is a universal tool for a fuzzy modeling with convincing applications to image processing. The aim of this contribution is to explain the effect of the F transform in image processing. With this purpose, we investigate properties of the Fourier transform over the F -transform components. We prove that the direct F -transform is a low-pass filter. Thi...
متن کاملSelf Fourier functions and fractional Fourier transforms
It was shown [ 21 that any SFF can be decomposed in this manner. Thus, F(x) is an SFF if, and only if, it can be expressed as the sum of four functions in the form of the above equation. Additional SFF studies are reported in refs. [ 3-51. Another issue that has been recently investigated is the fractional Fourier transform [ 6-91. Two distinct definitions of the fractional Fourier transform ha...
متن کاملDiscrete–time Fourier Series and Fourier Transforms
We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...
متن کاملDiscrete–time Fourier Series and Fourier Transforms
We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1971
ISSN: 0002-9947
DOI: 10.2307/1995556